0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.16/0.36 % Computer : n003.cluster.edu 0.16/0.36 % Model : x86_64 x86_64 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.36 % Memory : 8042.1875MB 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.36 % CPULimit : 1200 0.16/0.36 % WCLimit : 120 0.16/0.36 % DateTime : Tue Jul 13 16:11:54 EDT 2021 0.16/0.36 % CPUTime : 0.16/0.36 % Number of cores: 8 0.16/0.37 % Python version: Python 3.6.8 0.16/0.37 # Version: 2.6rc1-ho 0.16/0.38 # No SInE strategy applied 0.16/0.38 # Trying AutoSched0 for 59 seconds 0.23/0.47 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.23/0.47 # and selection function SelectMaxLComplexAvoidPosPred. 0.23/0.47 # 0.23/0.47 # Preprocessing time : 0.076 s 0.23/0.47 0.23/0.47 # Proof found! 0.23/0.47 # SZS status Theorem 0.23/0.47 # SZS output start CNFRefutation 0.23/0.47 thf(fact_0_eqsLessX, axiom, ![X86:a]:(ord_less_int @ (h @ X86) @ (h @ x)<=member_a @ X86 @ (binary504661350_eqs_a @ h @ e)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_eqsLessX)). 0.23/0.47 thf(conj_0, conjecture, ![X302:a]:((h @ X302)!=(h @ x)<=member_a @ X302 @ (binary504661350_eqs_a @ h @ e)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.23/0.47 thf(fact_224_dual__order_Oirrefl, axiom, ![X197:int]:~(ord_less_int @ X197 @ X197), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_224_dual__order_Oirrefl)). 0.23/0.47 thf(c_0_3, plain, ![X86:a]:(member_a @ X86 @ (binary504661350_eqs_a @ h @ e)=>ord_less_int @ (h @ X86) @ (h @ x)), inference(fof_simplification,[status(thm)],[fact_0_eqsLessX])). 0.23/0.47 thf(c_0_4, negated_conjecture, ~(![X302:a]:(member_a @ X302 @ (binary504661350_eqs_a @ h @ e)=>(h @ X302)!=(h @ x))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.23/0.47 thf(c_0_5, plain, ![X1889:a]:(~member_a @ X1889 @ (binary504661350_eqs_a @ h @ e)|ord_less_int @ (h @ X1889) @ (h @ x)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])). 0.23/0.47 thf(c_0_6, negated_conjecture, (member_a @ esk54_0 @ (binary504661350_eqs_a @ h @ e)&(h @ esk54_0)=(h @ x)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.23/0.47 thf(c_0_7, plain, ![X197:int]:~ord_less_int @ X197 @ X197, inference(fof_simplification,[status(thm)],[fact_224_dual__order_Oirrefl])). 0.23/0.47 thf(c_0_8, plain, ![X11:a]:(ord_less_int @ (h @ X11) @ (h @ x)|~member_a @ X11 @ (binary504661350_eqs_a @ h @ e)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.23/0.47 thf(c_0_9, negated_conjecture, (h @ esk54_0)=(h @ x), inference(split_conjunct,[status(thm)],[c_0_6])). 0.23/0.47 thf(c_0_10, plain, ![X1736:int]:~ord_less_int @ X1736 @ X1736, inference(variable_rename,[status(thm)],[c_0_7])). 0.23/0.47 thf(c_0_11, plain, ![X11:a]:(ord_less_int @ (h @ X11) @ (h @ esk54_0)|~member_a @ X11 @ (binary504661350_eqs_a @ h @ e)), inference(rw,[status(thm)],[c_0_8, c_0_9])). 0.23/0.47 thf(c_0_12, negated_conjecture, member_a @ esk54_0 @ (binary504661350_eqs_a @ h @ e), inference(split_conjunct,[status(thm)],[c_0_6])). 0.23/0.47 thf(c_0_13, plain, ![X5:int]:~ord_less_int @ X5 @ X5, inference(split_conjunct,[status(thm)],[c_0_10])). 0.23/0.47 thf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13]), ['proof']). 0.23/0.47 # SZS output end CNFRefutation 0.23/0.47 # Proof object total steps : 15 0.23/0.47 # Proof object clause steps : 6 0.23/0.47 # Proof object formula steps : 9 0.23/0.47 # Proof object conjectures : 6 0.23/0.47 # Proof object clause conjectures : 3 0.23/0.47 # Proof object formula conjectures : 3 0.23/0.47 # Proof object initial clauses used : 4 0.23/0.47 # Proof object initial formulas used : 3 0.23/0.47 # Proof object generating inferences : 1 0.23/0.47 # Proof object simplifying inferences : 2 0.23/0.47 # Training examples: 0 positive, 0 negative 0.23/0.47 # Parsed axioms : 404 0.23/0.47 # Removed by relevancy pruning/SinE : 0 0.23/0.47 # Initial clauses : 799 0.23/0.47 # Removed in clause preprocessing : 108 0.23/0.47 # Initial clauses in saturation : 691 0.23/0.47 # Processed clauses : 188 0.23/0.47 # ...of these trivial : 15 0.23/0.47 # ...subsumed : 49 0.23/0.47 # ...remaining for further processing : 124 0.23/0.47 # Other redundant clauses eliminated : 29 0.23/0.47 # Clauses deleted for lack of memory : 0 0.23/0.47 # Backward-subsumed : 1 0.23/0.47 # Backward-rewritten : 1 0.23/0.47 # Generated clauses : 185 0.23/0.47 # ...of the previous two non-trivial : 127 0.23/0.47 # Contextual simplify-reflections : 1 0.23/0.47 # Paramodulations : 105 0.23/0.47 # Factorizations : 0 0.23/0.47 # NegExts : 6 0.23/0.47 # Equation resolutions : 33 0.23/0.47 # Propositional unsat checks : 0 0.23/0.47 # Propositional check models : 0 0.23/0.47 # Propositional check unsatisfiable : 0 0.23/0.47 # Propositional clauses : 0 0.23/0.47 # Propositional clauses after purity: 0 0.23/0.47 # Propositional unsat core size : 0 0.23/0.47 # Propositional preprocessing time : 0.000 0.23/0.47 # Propositional encoding time : 0.000 0.23/0.47 # Propositional solver time : 0.000 0.23/0.47 # Success case prop preproc time : 0.000 0.23/0.47 # Success case prop encoding time : 0.000 0.23/0.47 # Success case prop solver time : 0.000 0.23/0.47 # Current number of processed clauses : 97 0.23/0.47 # Positive orientable unit clauses : 41 0.23/0.47 # Positive unorientable unit clauses: 0 0.23/0.47 # Negative unit clauses : 9 0.23/0.47 # Non-unit-clauses : 47 0.23/0.47 # Current number of unprocessed clauses: 627 0.23/0.47 # ...number of literals in the above : 1654 0.23/0.47 # Current number of archived formulas : 0 0.23/0.47 # Current number of archived clauses : 2 0.23/0.47 # Clause-clause subsumption calls (NU) : 645 0.23/0.47 # Rec. Clause-clause subsumption calls : 548 0.23/0.47 # Non-unit clause-clause subsumptions : 46 0.23/0.47 # Unit Clause-clause subsumption calls : 57 0.23/0.47 # Rewrite failures with RHS unbound : 0 0.23/0.47 # BW rewrite match attempts : 20 0.23/0.47 # BW rewrite match successes : 1 0.23/0.47 # Condensation attempts : 0 0.23/0.47 # Condensation successes : 0 0.23/0.47 # Termbank termtop insertions : 48177 0.23/0.47 0.23/0.47 # ------------------------------------------------- 0.23/0.47 # User time : 0.089 s 0.23/0.47 # System time : 0.010 s 0.23/0.47 # Total time : 0.099 s 0.23/0.47 # Maximum resident set size: 2460 pages 0.23/0.47 EOF